Low rank matrix recovery from rank one measurements
نویسندگان
چکیده
منابع مشابه
Low rank matrix recovery from rank one measurements
We study the recovery of Hermitian low rank matrices X ∈ Cn×n from undersampled measurements via nuclear norm minimization. We consider the particular scenario where the measurements are Frobenius inner products with random rank-one matrices of the form ajaj for some measurement vectors a1, . . . , am, i.e., the measurements are given by yj = tr(Xaja ∗ j ). The case where the matrix X = xx ∗ to...
متن کاملLow-rank matrix recovery via rank one tight frame measurements
The task of reconstructing a low rank matrix from incomplete linear measurements arises in areas such as machine learning, quantum state tomography and in the phase retrieval problem. In this note, we study the particular setup that the measurements are taken with respect to rank one matrices constructed from the elements of a random tight frame. We consider a convex optimization approach and s...
متن کاملLow-Rank Matrix Recovery from Row-and-Column Affine Measurements
We propose and study a row-and-column affine measurement scheme for low-rank matrix recovery. Each measurement is a linear combination of elements in one row or one column of a matrix X . This setting arises naturally in applications from different domains. However, current algorithms developed for standard matrix recovery problems do not perform well in our case, hence the need for developing ...
متن کاملUniversal low-rank matrix recovery from Pauli measurements
We study the problem of reconstructing an unknown matrix M of rank r and dimension d using O(rdpoly log d) Pauli measurements. This has applications in quantum state tomography, and is a non-commutative analogue of a well-known problem in compressed sensing: recovering a sparse vector from a few of its Fourier coefficients. We show that almost all sets of O(rd log d) Pauli measurements satisfy ...
متن کاملNonconvex Matrix Factorization from Rank-One Measurements
We consider the problem of recovering low-rank matrices from random rank-one measurements, which spans numerous applications including covariance sketching, phase retrieval, quantum state tomography, and learning shallow polynomial neural networks, among others. Our approach is to directly estimate the low-rank factor by minimizing a nonconvex quadratic loss function via vanilla gradient descen...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied and Computational Harmonic Analysis
سال: 2017
ISSN: 1063-5203
DOI: 10.1016/j.acha.2015.07.007